منابع مشابه
Nondeterminism and Fully Abstract Models
— We study the semantics ofsome nondeterministic languages derivedfrom PCF [8]. In particular we discuss how Milner" s results in [5] can (or cannoi) be applied to obtain models,for our languages, which arefully abstract with respect to the (standard) operational semantics. Résumé. — Nous étudions ici la sémantique de quelques langages non déterministes, dérivés du PCF [8]. En particulier, nous...
متن کاملA Fully Abstract Game Semantics for Finite Nondeterminism
A game semantics of finite nondeterminism is proposed. In this model, a strategy may make a choice between different moves in a given situation; moreover, strategies carry extra information about their possible divergent behaviour. A Cartesian closed category is built and a model of a simple, higher-order nondeterministic imperative language is given. This model is shown to be fully abstract, w...
متن کاملFully abstract models of programming languages
We present a theory of fully abstract denotational semantics of programming languages. Following initial algebra semantics, syntax is specified by manysorted signatures, and models are universal algebras whose carriers are complete partial orders and operations are continuous. The informal requirement that the meanings of iteration and recursion constructs be least fixed points of appropriate u...
متن کاملFully-Abstract Statecharts Semantics via Intuitionistic Kripke Models
The semantics of Statecharts macro steps, as introduced by Pnueli and Shalev, lacks compositionality. This paper rst analyzes the compositionality problem and traces it back to the invalidity of the Law of the Excluded Middle. It then characterizes the semantics via a particular class of linear, intuitionistic Kripke models, namely stabilization sequences. This yields, for the rst time in the l...
متن کاملModels Supporting Nondeterminism and Probabilistic Choice
In this paper we describe the problems encountered in building a semantic model that supports both nondeterministic choice and probabilistic choice. Several models exist that support both of these constructs, but none that we know of satis es all the laws one would like. Using domain-theoretic techniques, we show how a model can be devised \on top of" certain models for probabilistic choice, so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1980
ISSN: 0399-0540
DOI: 10.1051/ita/1980140403231